"Planar" Tautologies Hard for Resolution
نویسندگان
چکیده
We prove exponential lower bounds on the resolution proofs of some tautologies, based on rectangular grid graphs. More specifically, we show a 2Ω(n) lower bound for any resolution proof of the mutilated chessboard problem on a 2n× 2n chessboard as well as for the Tseitin tautology based on the n×n rectangular grid graph. The former result answers a 35 year old conjecture by McCarthy.
منابع مشابه
Polynomial Simulation and Refutation of Complex Formulas of Resolution over Linear Equations in Propositional Proof System
Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linear Equations) established by Ran Raz and Iddo Tzameret is not a super system, there exists a sequence of tautologies, which require proof complexity exponential in size of tautologies. We show that there are the sequence of unsatisfiable collections of disjuncts of linear equations, which require ...
متن کاملResolution over Linear Equations and Multilinear Proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses. We demonstrate polynomial-size refutations for hard tautologies like the pigeonhole principle, Tseitin graph tautologies and the clique-coloring tautologies in these proof systems. Using the (monotone) int...
متن کاملNondeterministic Instance Complexity and Hard-to-Prove Tautologies
In this note we rst formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are innnitely many propositional tautologies that are hard to prove in any sound propositional proof system.
متن کاملThe Strength of Parameterized Tree-like Resolution
We examine the proof-theoretic strength of parameterized tree-like resolution—a proof system for the coW[2]complete set of parameterized tautologies. Parameterized resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider (FOCS’07). In that paper, Dantchev et al. show a complexity gap in parameterized tree-like resolution fo...
متن کاملTel Aviv University the Raymond and Beverly Sackler Faculty of Exact Sciences School of Computer Science Studies in Algebraic and Propositional Proof Complexity
The field of proof complexity aims at characterizing which statements have short proofs in a given formal proof system. This thesis is a contribution to proof complexity broadly construed as the field that studies the sizes of structured or symbolic proofs. Our focus will be on the development and complexity-theoretic study of new frameworks, mainly of an algebraic nature, for providing, among ...
متن کامل